ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse
نویسندگان
چکیده
Grammar logics were introduced by Fariñas del Cerro and Penttonen in [7] and have been widely studied. In this paper we consider regular grammar logics with converse (REG logics) and present sound and complete tableau calculi for the general satisfiability problem of REG logics and the problem of checking consistency of an ABox w.r.t. a TBox in a REG logic. Using our calculi we develop ExpTime (optimal) tableau decision procedures for the mentioned problems, to which various optimization techniques can be applied. We also prove a new result that the data complexity of the instance checking problem in REG logics is coNP-complete.
منابع مشابه
Tableaux for Regular Grammar Logics of Agents Using Automaton-Modal Formulae
We present sound and complete tableau calculi for the class of regular grammar logics and a class eRG of extended regular grammar logics which contains useful epistemic logics for reasoning about beliefs of agents. Our tableau rules use a special feature called automaton-modal formulae which are similar to formulae of automaton propositional dynamic logic. Our calculi are cut-free and have the ...
متن کاملA Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are similar to formulae of automaton propositional dynamic logic. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. We show that the known EXPTIME upper bound for regular gr...
متن کاملA Cut-Free ExpTime Tableau Decision Procedure for the Logic Extending Converse-PDL with Regular Inclusion Axioms
We give the first cut-free ExpTime (optimal) tableau decision procedure for the logic CPDLreg, which extends Converse-PDL with regular inclusion axioms characterized by finite automata. The logic CPDLreg is the combination of Converse-PDL and regular grammar logic with converse. Our tableau decision procedure uses global state caching and has been designed to increase efficiency and allow vario...
متن کاملAnalytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
We present a sound and complete tableau calculus for a class BReg of extended regular grammar logics which contains useful epistemic logics for reasoning about agent beliefs. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. Applying sound global caching to the calculus, we obtain the first optimal (EXPTime) tableau decision procedure for BReg...
متن کاملDecision Procedures for Expressive Description Logics with Intersection, Composition, Converse of Roles and Role Identity
In the quest for expressive description logics for real-world applications, a powerful combination of constructs has so far eluded practical decision procedures: intersection and composition of roles. We propose tableau-based decision procedures for the satisfiability of logics extending ALC with the intersectionu, composition◦, uniont, converse ·− of roles and role identity id(·). We show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 98 شماره
صفحات -
تاریخ انتشار 2011